|
In number theory, the Kempner function ''S''(''n'')〔Called the Kempner numbers in the Online Encyclopedia of Integer Sequences: see 〕 is defined for a given positive integer ''n'' to be the smallest number ''s'' such that ''n'' divides the factorial ''s''!. For example, the number 8 does not divide 1 This function has the property that it grows linearly on the prime numbers but only grows sublogarithmically at the factorial numbers. ==History== This function was first considered by François Édouard Anatole Lucas in 1883,〔 〕 followed by Joseph Jean Baptiste Neuberg in 1887〔 〕 and A. J. Kempner, who in 1918 gave the first correct algorithm for computing ''S''(''n'').〔 〕 The function was called the "Smarandache function" in a 1980 publication by Florentin Smarandache that noted the existence of many other publications on the subject but cited none of them.〔 〕 Others have since used the same name.〔 〕〔 〕〔 〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Kempner function」の詳細全文を読む スポンサード リンク
|